Sinc.doc 921023 Local Grammars and Their Representation by Finite Automata
نویسنده
چکیده
In the study of collocations and of frozen sentences (idioms, clichés, collocations, many metaphors and figurative meanings, etc.) one often encounters sets of similar forms that cannot be related by formal rules of either type: phrase structure or transformational. We present examples of such situations and we show how the formalism of finite automata can be used to represent them in a natural way.
منابع مشابه
Syntactic Analysis by Local Grammars Automata: an Efficient Algorithm
The description of the constraints restricting words' combinations in specific contexts provides helpful grammars for reducing the number of ambiguities of lemmatized texts. These grammars allow to easily eliminate many of the ambiguities without even using complex general syntactic rules involving a lexicon-grammar. Local grammars can be represented in a very natural way by finite state automa...
متن کاملA Time-Efficient Token Representation for Parsers
One of the most important functions of linguistic tools is to apply grammars to texts in order to find matching sequences. These grammars are often represented by finite-state automata. The expressions described in these grammars are usually lexical units, but some systems offer the possibility of dealing with references to sets of words which require the use of electronic dictionaries (ex. ...
متن کاملOn the Correspondence between Compositional Matrix-Space Models of Language and Weighted Automata
Compositional matrix-space models of language were recently proposed for the task of meaning representation of complex text structures in natural language processing. These models have been shown to be a theoretically elegant way to model compositionality in natural language. However, in practical cases, appropriate methods are required to learn such models by automatically acquiring the necess...
متن کاملOne-stack Automata as Acceptors of Context-free Languages*
This paper presents one-stack automata as acceptors of context-free languages; these are equivalent to Pushdown Automata which are well known in automata theory. As equivalence relations such as equivalence of Turing Machines and two-stack Pushdown Automata help in learning general properties of formal modeling, the equivalence relation of Pushdown Automata and one-stack automata also helps in ...
متن کاملGrammar Design with Multi-tape Automata and Composition
In this paper we show how traditional composition-based finite-state grammars can be augmented to preserve intermediate results in a chain of compositions. These intermediate strings can be very helpful for various tasks: enriching information while parsing or generating, providing accurate information for debugging purposes as well as offering explicit alignment information between morphemes a...
متن کامل